A sequential sampling procedure for genetic algorithms
نویسندگان
چکیده
منابع مشابه
A Sequential Sampling Procedure for Genetic Algorithms
In this paper, we apply sequential decision theory for scheduling tests in genetic algorithms and investigate an efficient sampling procedure for improving its performance. We use a loss function specifically defined for our analysis and obtain sequential decision equations for the optimal procedure. We derive simplified equations so that the procedure can be applied in practice. Finally, we co...
متن کاملA Sequential Sampling Procedure for Stochastic Programming
We develop a sequential sampling procedure for a class of stochastic programs. We assume that a sequence of feasible solutions with an optimal limit point is given as input to our procedure. Such a sequence can be generated by solving a series of sampling problems with increasing sample size, or it can be found by any other viable method. Our procedure estimates the optimality gap of a candidat...
متن کاملTwo-Stage Sequential Sampling: A Neighborhood-Free Adaptive Sampling Procedure
Designing an efficient sampling scheme for a rare and clustered population is a challenging area of research. Adaptive cluster sampling, which has been shown to be viable for such a population, is based on sampling a neighborhood of units around a unit that meets a specified condition. However, the edge units produced by sampling neighborhoods have proven to limit the efficiency and applicabili...
متن کاملOptimal Sampling for Genetic Algorithms
In many real-world environments, a genetic algorithm designer is often faced with choosing the best tness function from a range of possibilities. Fitness functions diier primarily based upon the speed, accuracy, and cost of a tness evaluation. An important type of tness function is the sampling tness function, which utilizes sampling in order to reduce the noise of tness evaluations. The accura...
متن کاملIndependent Sampling Genetic Algorithms
Premature convergence is the loss of diversity in the population that has long been recognized as one crucial factor that hinders the efficacy of crossover. In this paper, a strategy for independent sampling of building blocks is proposed in order to nicely implement implicit parallelism. Based on this methodology, we developed a modified version of GA: independent sampling genetic algorithms (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1994
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)90126-0